A linear-time algorithm for the longest path problem in rectangular grid graphs
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولLinear Time Algorithm for the Longest Common Repeat Problem
Given a set of strings U = {T1, T2, . . . , T`}, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U . We also consider reversed and reverse-complemented repeats as well as normal repeats. We present a linear time algorithm for the longest common repeat problem.
متن کاملLinear Time Algorithm for the Generalised Longest Common Repeat Problem
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U , considering direct, inverted, mirror as well as everted repeats. In this paper we define the generalised longest common repeat problem, where we can set the number of times that a repeat should appear in each string. We pres...
متن کاملThe Longest Path Problem on Permutation Graphs
The longest path problem on graph G is a classic problem which is to find a simple path such that the number of vertices of the path is maximum among all possible paths of G. In this paper, we show that the longest path problem can be solved in linear time on permutation graphs.
متن کاملA Linear-Time Algorithm for the Terminal Path Cover Problem in Block Graphs
In this paper, we study a variant of the path cover problem, namely, the terminal path cover problem. Given a graph G and a subset T of vertices of G, a terminal path cover of G with respect to T is a set of pairwise vertex-disjoint paths PC that covers the vertices of G such that the vertices of T are all endpoints of the paths in PC. The terminal path cover problem is to find a terminal path ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.08.010